Minimizing the weighted sum of squared tardiness on a single machine
نویسندگان
چکیده
منابع مشابه
Minimizing Total Weighted Tardiness with Drop Dead Dates in Single Machine Scheduling Problem
This paper deals with minimization of tardiness in single machine scheduling problem when each job has two different due-dates i.e. ordinary due-date and drop dead date. The drop dead date is the date in which jobs’ weights rise sharply or the customer cancels the order. A linear programming formulation is developed for the problem and since the problem is known to be NP-hard, three heuristic...
متن کاملMinimizing the Sum of Makespan and Maximum Tardiness on Single Machine with Release Dates
This paper considers the bicriteria scheduling problem of simultaneously minimizing makespan (Cmax) and maximum tardiness (Tmax) on a single machine with release dates. The problem is, by nature, NP-Hard. Therefore, one approximation algorithm (labeled as CTA1) was proposed for solving this problem. The CTA1 algorithm was compared with the Branch and Bounds (BB) procedure specifically implement...
متن کاملApproximation algorithms for minimizing the total weighted tardiness on a single machine
Given a single machine and a set of jobs with due dates, the classical NP-hard problem of scheduling to minimize total tardiness is a well-understood one. Lawler gave an FPTAS for it some twenty years ago. If the jobs have positive weights the problem of minimizing total weighted tardiness seems to be considerably more intricate. In this paper, we give some of the first approximation algorithms...
متن کاملMinimizing total weighted tardiness on a single machine with release dates and equal-length jobs
In this paper we look at the problem where we have to schedule n jobs with release dates, due dates, weights, and equal processing times on a single machine. The objective is to minimize the sum of weighted tardiness (1|rj , pj = p| ∑ wjTj in the threefield notation scheme). We formulate the problem as a time indexed ILP after which we solve the LP-relaxation. We show that for certain special c...
متن کاملMinimizing total weighted tardiness on a single batch process machine with incompatible job families
The di0usion step in semiconductor wafer fabrication is very time consuming, compared to other steps in the process, and performance in this area has a signi1cant impact on overall factory performance. Di0usion furnaces are able to process multiple lots of similar wafers at a time, and are therefore appropriately modeled as batch processing machines with incompatible job families. Due to the im...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Computers & Operations Research
سال: 2012
ISSN: 0305-0548
DOI: 10.1016/j.cor.2011.07.018